#include <iostream>

using namespace std;
const int N = 100010;
int p[N];

void quick_sort(int p[], int l, int r)
{
    if(l >= r) return;

    int i = l - 1, j = r + 1, x = p[(l + r) >> 1];
    while(i < j)
    {
        do i++; while(p[i] < x);
        do j--; while(p[j] > x);
        if(i < j) swap(p[i], p[j]);
    }
    quick_sort(p, l, j), quick_sort(p, j + 1, r);
}
int main()
{
    int n, x;
    cin >> n >> x;
    for(int i = 0; i < n; i++) cin >> p[i];

    quick_sort(p, 0, n - 1);

    int i = 0, j = n - 1;
    while(i < j)
    {
        int mid = (i + j) >> 1;
        if(p[mid] >= x) j = mid;
        else i = mid + 1;
    }
    cout << j + 1 << endl;

    return 0;

}
